A Multi-Tenant Key-Value SSD with Secondary Index for Search Query Processing and Analysis
نویسندگان
چکیده
Key-Value SSDs (KVSSDs) introduced so far are limited in their use as an alternative to the key-value store running on host due following technical limitations. First, they were designed only for single tenant, limiting of multiple tenants. Second, mainly focused designing indexes primary key-based searches, without supporting various queries using a combination key and non-primary attributes-based searches. This paper proposes Cerberus , Log Structured Merged (LSM) tree-based KVSSD armed with (i) namespace performance isolation tenants multi-tenant environment, (ii) capability processing search queries. Specifically, identifies tenant’s splits large LSM-tree into namespace-specific also manages secondary enable data access fast query processing. With SSD-internal CPU/DRAM resources, supports handles complex that combined computing operations. We prototyped Cosmos+ OpenSSD platform. When there tenants, exhibits up 2.9 × higher read throughput negligible write overhead compared existing KVSSD. shows lower latency by 9.31 query.
منابع مشابه
Memshare: a Dynamic Multi-tenant Key-value Cache
Web application performance heavily relies on the hit rate of DRAM key-value caches. Current DRAM caches statically partition memory across applications that share the cache. This results in under utilization and limits cache hit rates. We present Memshare, a DRAM key-value cache that dynamically manages memory across applications. Memshare provides a resource sharing model that guarantees rese...
متن کاملMemshare: a Dynamic Multi-tenant Memory Key-value Cache
Web application performance is heavily reliant on the hit rate of memory-based caches. Current DRAM-based web caches statically partition their memory across multiple applications sharing the cache. This causes under utilization of memory which negatively impacts cache hit rates. We present Memshare, a novel web memory cache that dynamically manages memory across applications. Memshare provides...
متن کاملA Path-Oriented RDF Index for Keyword Search Query Processing
Most of the recent approaches to keyword search employ graph structured representation of data. Answers to queries are generally sub-structures of the graph, containing one or more keywords. While finding the nodes matching keywords is relatively easy, determining the connections between such nodes is a complex problem requiring onthe-fly time consuming graph exploration. Current techniques suf...
متن کاملA Novel Index Structure for Multi-key Search
The linear storage model is widely used to support inmemory multi-key search running on small devices of limited computing capacity, simply because it avoids the maintenance of space-costly and energy-costly indexing structures. However, it only supports sequential multi-key scan which is slow and energy-consuming. We design an index structure called D-Tree to address the problem.
متن کاملEfficient Query Integrity Protection for Multi-tenant Database
In SaaS, since the service provider may be un-trusted, it is essential for tenants to enable query result correctness and completeness. However, existing data authentication methods can not fit well with the customized multi-tenants sharing storage mode. This paper put forward a multi-tenant data authentication model (TCDA). TCDA is a composite structure that constructs pivot authentication tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions in Embedded Computing Systems
سال: 2023
ISSN: ['1539-9087', '1558-3465']
DOI: https://doi.org/10.1145/3590153